Extended primitive recursive functions

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extended Primitive Recursive Functions

— In this paper we extend the notion of primitive recursive function to the case in which the domain is N* and the range is a subset oj N*. We give a rigorvus characterization oj tins class oj functions and show différences icith the classical primitive recursive functions. Résumé. — Dans cette note nous étendons la notion de f onction primitive recursive à tous les cas dans lesquels le domaine...

متن کامل

Primitive Recursive Functions

1. Definition of recursive functions. In this paper, we shall consider certain reductions in the recursion scheme for defining primitive recursive functions. Hereafter, we shall refer to such functions simply as recursive functions. In §1, we define what is meant by a recursive function, and also define some recursive functions which will be used. The statement of the principal results of the p...

متن کامل

Unary Primitive Recursive Functions

In this article, we will study certain reductions in the schemes that conform unary primitive recursive functions (i.e. primitive recursive functions of one argument) and we will extend some results previously researched by R. M. Robinson in [15]. Furthermore, we will introduce formal notation for unary primitive recursive functions. §

متن کامل

A Hierarchy of primitive recursive sequence functions

— In this paper we give a characterization of primitive recursive functions ƒ : N~* N{r^0, s>0) and define a Hierarchy of classes b^O) of these functions by a syntactic measure ofeomplexity. The behavior ofthe classes J^a+b^ respect to different operators is also analyzed. The classes J^ + b coincide with the ones ofCleavé's hierarchy for a^2,b^0 and give a refinement of the Meyer-Ri...

متن کامل

A Class of Reversible Primitive Recursive Functions

Reversible computing is bi-deterministic which means that its execution is both forward and backward deterministic, i.e. next/previous computational step is uniquely determined. Various approaches exist to catch its extensional or intensional aspects and properties. We present a class RPRF of reversible functions which holds at bay intensional aspects and emphasizes the extensional side of the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: RAIRO. Informatique théorique

سال: 1982

ISSN: 0399-0540

DOI: 10.1051/ita/1982160100731